in this article, we have shown, for the add-point monad t, thepartial morphism category set*is isomorphic to the kleisli category sett. alsowe have proved that the category, sett, of t-algebras is isomorphic to thecategory set of pointed sets. finally we have established commutative squaresinvolving these categories.

The category is introduced as an ordered 5-tuple of the form 〈O,M,dom,cod, ·, id〉 where O (objects) and M (morphisms) are arbitrary nonempty sets, dom and cod map M onto O and assign to a morphism domain and codomain, · is a partial binary map from M×M to M (composition of morphisms), id applied to an object yields the identity morphism. We define the basic notions of the category theory such a...

E. Moggi, Categories of Partial Morphism and the p -calculus, In Category Theory and Computer Programming, Lecture Notes in Computer Science 240, SpringerVerlag, 1986. [Mog88a] E. Moggi, Computational Lambda-Calculus and Monads, Technical Report ECSLFCS-88-66, University of Edinburgh, October, 1988. [Mog88b] E. Moggi, Partial Morphisms in Categories of E ective Objects, Information and Computat...

In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.

We present a definition of term graph rewriting as the taking of a pushout in a category of partial morphisms, adapting the rather ad hoc definitions we gave in [Ken87] so as to use a standard category-theoretic concept of partial morphism. This single-pushout construction is shown to coincide with the well-known double-pushout description of graph rewriting whenever the latter is defined. In g...

We investigate a categorical framework for the semantics of asynchronous communication in networks of parallel processes. Abstracting from a category of asynchronous labeled transition systems, we formulate the notion of a categorical model of asynchrony as a uniformly traced monoidal category with diagonals, such that every morphism is total and the focus is equivalent to a category of complet...

A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak asynchronous systems and polygonal mor-phisms has all limits and colimits.

With the notions of partial morphism and relation to be understood with respect to a class M of monomorphisms in a nitely complete category C, we give suucient conditions for the graph functor P ar(C) ! Rel(C) to admit a right adjoint. Only under an additional condition is this right adjoint given by the naturally constructed \pierced power objects".

‎in this paper first we define the morphism between geometric spaces in two different types‎. ‎we construct two categories of $uu$ and $l$ from geometric spaces then investigate some properties of the two categories‎, ‎for instance $uu$ is topological‎. ‎the relation between hypergroups and geometric spaces is studied‎. ‎by constructing the category $qh$ of $h_{v}$-groups we answer the question...